0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.34	% Computer   : n026.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 13:46:14 EDT 2021
0.12/0.34	% CPUTime    : 
0.12/0.34	% Number of cores: 8
0.12/0.34	% Python version: Python 3.6.8
0.12/0.35	# Version: 2.6rc1-ho
0.12/0.35	# No SInE strategy applied
0.12/0.35	# Trying AutoSched0 for 59 seconds
0.20/0.46	# AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_S5PRR_SE_Q4_CS_SP_S4S
0.20/0.46	# and selection function SelectNewComplexAHPNS.
0.20/0.46	#
0.20/0.46	# Preprocessing time       : 0.043 s
0.20/0.46	
0.20/0.46	# Proof found!
0.20/0.46	# SZS status Theorem
0.20/0.46	# SZS output start CNFRefutation
0.20/0.46	thf(setminusEL, conjecture, (dsetconstrEL=>![X1:$i, X5:$i, X3:$i]:(in @ X3 @ (setminus @ X1 @ X5)=>in @ X3 @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setminusEL)).
0.20/0.46	thf(dsetconstrEL, axiom, (dsetconstrEL<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))=>in @ X3 @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrEL)).
0.20/0.46	thf(setminus, axiom, (setminus)=(^[X1:$i, X5:$i]:dsetconstr @ X1 @ (^[X3:$i]:~(in @ X3 @ X5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setminus)).
0.20/0.46	thf(c_0_3, plain, ![X4:$i, X2:$i > $o]:(epred2_2 @ X2 @ X4<=>X2 @ X4), introduced(definition)).
0.20/0.46	thf(c_0_4, plain, ![X12:$i, X5:$i]:(epred1_2 @ X5 @ X12<=>~in @ X12 @ X5), inference(fof_simplification,[status(thm)],[introduced(definition)])).
0.20/0.46	thf(c_0_5, negated_conjecture, ~((![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (epred2_2 @ X2))=>in @ X3 @ X1)=>![X1:$i, X5:$i, X3:$i]:(in @ X3 @ (setminus @ X1 @ X5)=>in @ X3 @ X1))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setminusEL]), dsetconstrEL]), c_0_3])).
0.20/0.46	thf(c_0_6, plain, ![X1:$i, X5:$i]:(setminus @ X1 @ X5)=(dsetconstr @ X1 @ (epred1_2 @ X5)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[setminus]), c_0_4])).
0.20/0.46	thf(c_0_7, negated_conjecture, ![X15:$i, X16:$i > $o, X17:$i]:((~in @ X17 @ (dsetconstr @ X15 @ (epred2_2 @ X16))|in @ X17 @ X15)&(in @ esk3_0 @ (setminus @ esk1_0 @ esk2_0)&~in @ esk3_0 @ esk1_0)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
0.20/0.46	thf(c_0_8, plain, ![X13:$i, X14:$i]:(setminus @ X13 @ X14)=(dsetconstr @ X13 @ (epred1_2 @ X14)), inference(variable_rename,[status(thm)],[c_0_6])).
0.20/0.46	thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(in @ X1 @ X3|~in @ X1 @ (dsetconstr @ X3 @ (epred2_2 @ X2))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.46	thf(c_0_10, plain, ![X1:$i, X3:$i]:(setminus @ X1 @ X3)=(dsetconstr @ X1 @ (epred1_2 @ X3)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.46	thf(c_0_11, plain, ![X1:$i, X2:$i > $o, X3:$i, X4:$i]:(in @ X1 @ X3|(epred1_2 @ X4)!=(epred2_2 @ X2)|~in @ X1 @ (setminus @ X3 @ X4)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_9, c_0_10])])).
0.20/0.46	thf(c_0_12, plain, ![X2:$i > $o, X1:$i, X3:$i, X4:$i]:(in @ X1 @ X3|(epred1_2 @ X4 @ (esk4_2 @ X2 @ X4))!=(epred2_2 @ X2 @ (esk4_2 @ X2 @ X4))|~in @ X1 @ (setminus @ X3 @ X4)), inference(neg_ext,[status(thm)],[c_0_11])).
0.20/0.46	thf(c_0_13, plain, ![X23:$i, X24:$i > $o]:((~epred2_2 @ X24 @ X23|X24 @ X23)&(~X24 @ X23|epred2_2 @ X24 @ X23)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])).
0.20/0.46	thf(c_0_14, plain, ![X2:$i > $o, X4:$i, X3:$i, X1:$i]:(epred2_2 @ X2 @ (esk4_2 @ X2 @ X1)|epred1_2 @ X1 @ (esk4_2 @ X2 @ X1)|in @ X3 @ X4|~in @ X3 @ (setminus @ X4 @ X1)), inference(dynamic cnf,[status(thm)],[c_0_12])).
0.20/0.46	thf(c_0_15, negated_conjecture, in @ esk3_0 @ (setminus @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.46	thf(c_0_16, negated_conjecture, ~in @ esk3_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.46	thf(c_0_17, plain, ![X2:$i > $o, X1:$i]:(X2 @ X1|~epred2_2 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.20/0.46	thf(c_0_18, negated_conjecture, ![X2:$i > $o]:(epred1_2 @ esk2_0 @ (esk4_2 @ X2 @ esk2_0)|epred2_2 @ X2 @ (esk4_2 @ X2 @ esk2_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])).
0.20/0.46	thf(c_0_19, plain, ![X21:$i, X22:$i]:((~epred1_2 @ X22 @ X21|~in @ X21 @ X22)&(in @ X21 @ X22|epred1_2 @ X22 @ X21)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])).
0.20/0.46	thf(c_0_20, plain, ![X2:$i > $o]:(epred1_2 @ esk2_0 @ (esk4_2 @ X2 @ esk2_0)|X2 @ (esk4_2 @ X2 @ esk2_0)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.20/0.46	thf(c_0_21, plain, ![X2:$i > $o, X1:$i, X3:$i, X4:$i]:(in @ X1 @ X3|~epred1_2 @ X4 @ (esk4_2 @ X2 @ X4)|~epred2_2 @ X2 @ (esk4_2 @ X2 @ X4)|~in @ X1 @ (setminus @ X3 @ X4)), inference(dynamic cnf,[status(thm)],[c_0_12])).
0.20/0.46	thf(c_0_22, plain, ![X3:$i, X1:$i]:(in @ X1 @ X3|epred1_2 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_19])).
0.20/0.46	thf(c_0_23, plain, ![X2:$i > $o, X1:$i]:(epred2_2 @ X2 @ X1|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.20/0.46	thf(c_0_24, plain, epred1_2 @ esk2_0 @ (esk4_2 @ (epred1_2 @ esk2_0) @ esk2_0), inference(ef,[status(thm)],[c_0_20])).
0.20/0.46	thf(c_0_25, plain, ![X2:$i > $o, X4:$i, X3:$i, X1:$i]:(in @ (esk4_2 @ X2 @ X1) @ X1|in @ X3 @ X4|~epred2_2 @ X2 @ (esk4_2 @ X2 @ X1)|~in @ X3 @ (setminus @ X4 @ X1)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.20/0.46	thf(c_0_26, plain, epred2_2 @ (epred1_2 @ esk2_0) @ (esk4_2 @ (epred1_2 @ esk2_0) @ esk2_0), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.20/0.46	thf(c_0_27, plain, ![X1:$i, X3:$i]:(in @ (esk4_2 @ (epred1_2 @ esk2_0) @ esk2_0) @ esk2_0|in @ X1 @ X3|~in @ X1 @ (setminus @ X3 @ esk2_0)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.20/0.46	thf(c_0_28, plain, ![X3:$i, X1:$i]:(~epred1_2 @ X1 @ X3|~in @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_19])).
0.20/0.46	thf(c_0_29, negated_conjecture, in @ (esk4_2 @ (epred1_2 @ esk2_0) @ esk2_0) @ esk2_0, inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_15]), c_0_16])).
0.20/0.46	thf(c_0_30, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_24])]), ['proof']).
0.20/0.46	# SZS output end CNFRefutation
0.20/0.46	# Proof object total steps             : 31
0.20/0.46	# Proof object clause steps            : 20
0.20/0.46	# Proof object formula steps           : 11
0.20/0.46	# Proof object conjectures             : 8
0.20/0.46	# Proof object clause conjectures      : 5
0.20/0.46	# Proof object formula conjectures     : 3
0.20/0.46	# Proof object initial clauses used    : 8
0.20/0.46	# Proof object initial formulas used   : 3
0.20/0.46	# Proof object generating inferences   : 8
0.20/0.46	# Proof object simplifying inferences  : 5
0.20/0.46	# Training examples: 0 positive, 0 negative
0.20/0.46	# Parsed axioms                        : 7
0.20/0.46	# Removed by relevancy pruning/SinE    : 0
0.20/0.46	# Initial clauses                      : 12
0.20/0.46	# Removed in clause preprocessing      : 4
0.20/0.46	# Initial clauses in saturation        : 8
0.20/0.46	# Processed clauses                    : 116
0.20/0.46	# ...of these trivial                  : 1
0.20/0.46	# ...subsumed                          : 15
0.20/0.46	# ...remaining for further processing  : 100
0.20/0.46	# Other redundant clauses eliminated   : 1
0.20/0.46	# Clauses deleted for lack of memory   : 0
0.20/0.46	# Backward-subsumed                    : 0
0.20/0.46	# Backward-rewritten                   : 1
0.20/0.46	# Generated clauses                    : 331
0.20/0.46	# ...of the previous two non-trivial   : 134
0.20/0.46	# Contextual simplify-reflections      : 0
0.20/0.46	# Paramodulations                      : 194
0.20/0.46	# Factorizations                       : 2
0.20/0.46	# NegExts                              : 1
0.20/0.46	# Equation resolutions                 : 1
0.20/0.46	# Propositional unsat checks           : 0
0.20/0.46	#    Propositional check models        : 0
0.20/0.46	#    Propositional check unsatisfiable : 0
0.20/0.46	#    Propositional clauses             : 0
0.20/0.46	#    Propositional clauses after purity: 0
0.20/0.46	#    Propositional unsat core size     : 0
0.20/0.46	#    Propositional preprocessing time  : 0.000
0.20/0.46	#    Propositional encoding time       : 0.000
0.20/0.46	#    Propositional solver time         : 0.000
0.20/0.46	#    Success case prop preproc time    : 0.000
0.20/0.46	#    Success case prop encoding time   : 0.000
0.20/0.46	#    Success case prop solver time     : 0.000
0.20/0.46	# Current number of processed clauses  : 98
0.20/0.46	#    Positive orientable unit clauses  : 68
0.20/0.46	#    Positive unorientable unit clauses: 0
0.20/0.46	#    Negative unit clauses             : 2
0.20/0.46	#    Non-unit-clauses                  : 28
0.20/0.46	# Current number of unprocessed clauses: 25
0.20/0.46	# ...number of literals in the above   : 77
0.20/0.46	# Current number of archived formulas  : 0
0.20/0.46	# Current number of archived clauses   : 2
0.20/0.46	# Clause-clause subsumption calls (NU) : 333
0.20/0.46	# Rec. Clause-clause subsumption calls : 296
0.20/0.46	# Non-unit clause-clause subsumptions  : 15
0.20/0.46	# Unit Clause-clause subsumption calls : 0
0.20/0.46	# Rewrite failures with RHS unbound    : 0
0.20/0.46	# BW rewrite match attempts            : 1271
0.20/0.46	# BW rewrite match successes           : 1
0.20/0.46	# Condensation attempts                : 0
0.20/0.46	# Condensation successes               : 0
0.20/0.46	# Termbank termtop insertions          : 6843
0.20/0.46	
0.20/0.46	# -------------------------------------------------
0.20/0.46	# User time                : 0.108 s
0.20/0.46	# System time              : 0.005 s
0.20/0.46	# Total time               : 0.113 s
0.20/0.46	# Maximum resident set size: 1636 pages
0.20/0.46	EOF